Finding cliques using few probes
نویسندگان
چکیده
منابع مشابه
Complexity Results on Graphs with Few Cliques
A graph class has few cliques if there is a polynomial bound on the number of maximal cliques contained in any member of the class. This restriction is equivalent to the requirement that any graph in the class has a polynomial sized intersection representation that satisfies the Helly property. On any such class of graphs some problems that are NP-complete on general graphs, such as the maximum...
متن کاملFinding Cliques of a Graph using Prime Numbers
This paper proposes a new algorithm for solving maximal cliques for simple undirected graphs using the theory of prime numbers. A novel approach using prime numbers is used to find cliques and ends with a discussion of the algorithm.
متن کاملFinding Maximum k-Cliques Faster Using Lazy Global Domination
A clique in a graph is a set of vertices, each of which is adjacent to every other vertex in this set. A k-clique relaxes this requirement, requiring vertices to be within a distance k of each other, rather than directly adjacent. In theory, a maximum clique algorithm can easily be adapted to solve the maximum k-clique problem, although large sparse k-clique graphs reduce to large dense clique ...
متن کاملFinding Maximum Cliques on Circular-Arc Graphs
An algorithm is presented that, given the intersection model S of a circular-arc graph G with n vertices and m edges. finds a maximum-sized clique of GinO (n21oglogn) time. The previously best time bound for this problem is 0 (n 21ogn + mn). • 1ltis work was supported by Ihe Office of Naval Research under Conr:racr.s NOOOl4-84-K-DS02 and NOOOl4-86-K-0689. and by the National Science Foundation ...
متن کاملFinding hidden cliques in linear time
In the hidden clique problem, one needs to find the maximum clique in an n-vertex graph that has a clique of size k but is otherwise random. An algorithm of Alon, Krivelevich and Sudakov that is based on spectral techniques is known to solve this problem (with high probability over the random choice of input graph) when k ≥ c √ n for a sufficiently large constant c. In this manuscript we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2019
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.20896